Oracle game semantics for the nu-calculus
نویسندگان
چکیده
The long-standing problem of giving fully abstract semantics to the nu-calculus have been solved only recently with game models à la Hyland-Ong in the universe of Fraenkel-Mostowski sets. However, these models are still quite complicated, mainly because they aim to ensure at once both the equivariance of strategies, and the possibility of having strategies generating new names. In this paper, we present an alternative, and somehow simpler, game semantics for the nu-calculus, endorsing the “object-oriented” view of references. The idea is to deal first with equivariance, and then with name generation. More precisely, we define a game model where terms are interpreted by (equivariant) strategies parametrized by some oracle, which can be seen as an “external supplier” of fresh names to be interrogated on the need. The oracle is provided at a second stage, when a model of complete strategies is defined by means of an extensional equivalence.
منابع مشابه
A Game Semantics of Local Names and Good Variables
We describe a game semantics for local names in a functional setting. It is based on a category of dialogue games acted upon by the automorphism group of the natural numbers; this allows properties of names such as freshness and locality to be characterized semantically. We describe a model of the nu-calculus in this category, and extend it with named references (without bad variables) using na...
متن کاملA game semantics of names and pointers
We describe a fully abstract semantics for a simple functional language with locally declared names which may be used as pointers to names. It is based on a category of dialogue games acted upon by the group of natural number automorphisms. This allows a formal, semantic characterization of key properties of names such as freshness and locality. We describe a model of the call-by-value λ-calcul...
متن کاملGame Semantics for the Pure Lazy λ - calculus ?
In this paper we present a fully abstract game model for the pure lazy λ-calculus, i.e. the lazy λ-calculus without constants. In order to obtain this result we introduce a new category of games, the monotonic games, whose main characteristic consists in having an order relation on moves.
متن کاملFully Abstract Game Semantics for Actors
Along the way paved by the recent concurrent game semantics for process algebra CCS and π-calculus, based on the basic characteristics of the actor computational model and the very reductive semantics for actors, we establish a fully abstract concurrent game semantics for actors by borrowing the algebraic structure from CCS. This semantics can both be seen as an innocent presheaf semantics, and...
متن کاملBounded game-theoretic semantics for modal mu-calculus
We introduce a new game-theoretic semantics (GTS) for the modal μ-calculus. Our so-called bounded GTS replaces parity games with novel alternative evaluation games where only finite paths arise. Infinite paths are not needed even when the considered transition system is infinite.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007